首页> 外文OA文献 >Unsupervised Generative Modeling Using Matrix Product States
【2h】

Unsupervised Generative Modeling Using Matrix Product States

机译:使用矩阵乘积状态的无监督生成建模

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Generative modeling, which learns joint probability distribution fromtraining data and generates samples according to it, is an important task inmachine learning and artificial intelligence. Inspired by probabilisticinterpretation of quantum physics, we propose a generative model using matrixproduct states, which is a tensor network originally proposed for describing(particularly one-dimensional) entangled quantum states. Our model enjoysefficient learning by utilizing the density matrix renormalization group methodwhich allows dynamic adjusting dimensions of the tensors, and offers anefficient direct sampling approach, Zipper, for generative tasks. We apply ourmethod to generative modeling of several standard datasets including theprincipled Bars and Stripes, random binary patterns and the MNIST handwrittendigits, to illustrate ability of our model, and discuss features as well asdrawbacks of our model over popular generative models such as Hopfield model,Boltzmann machines and generative adversarial networks. Our work shed light onmany interesting directions for future exploration on the development ofquantum-inspired algorithms for unsupervised machine learning, which is ofpossibility of being realized by a quantum device.
机译:从训练数据中学习联合概率分布并据此生成样本的生成建模是机器学习和人工智能中的重要任务。受量子物理学概率解释的启发,我们提出了一种使用矩阵乘积态的生成模型,该模型是最初提出的用于描述(尤其是一维)纠缠量子态的张量网络。我们的模型通过使用密度矩阵重归一化组方法而享有高效的学习能力,该方法可以动态调整张量的尺寸,并为生成任务提供了一种有效的直接采样方法Zipper。我们将方法应用于几个标准数据集的生成模型,包括原则上的条纹和条形,随机二进制模式和MNIST手写数字,以说明我们的模型的功能,并讨论模型的功能以及与流行的生成模型(如Hopfield模型,Boltzmann模型)相比的缺点机器和生成对抗网络。我们的工作为未来探索无监督机器学习的量子启发算法开发提供了许多有趣的方向,这有可能由量子设备实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号